Some Essentials of Graph Transformation
نویسندگان
چکیده
This chapter introduces rule-based graph transformation, which constitutes a well-studied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure graph transformation more feasible for specification and modeling aspects. Moreover, a translation of Chomsky grammars into graph grammars is given and the main theorems concerning parallelism and concurrency are presented. Finally, an introduction to hyperedge replacement is given, a concept which has nice properties because it transforms hypergraphs in a context-free way.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملPre- requisites and essentials for accreditation in Iran Medical Education System
Introduction. Accreditation has a long antecedence in western countries educational systems and its history of implementation is more than a century in a country such as United States of America. In European countries, also different activities have been implied throughout the accreditation and its implementation has become an essential. Now, in our country the experts also think of the accredi...
متن کاملOn trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملEssentials of Term Graph Rewriting
Term graph rewriting is a model for computing with graphs representing functional expressions. Graphs allow to share common subexpressions which improves the eÆciency of conventional term rewriting in space and time. This article reviews essentials of term graph rewriting concerning soundness, completeness, termination and con uence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006